A detailed study of the generation of optically detectable watermarks using the logistic map

A digital watermark is a visible, or preferably invisible, identification code that is permanently embedded in digital media, to prove owner authentication and provide protection for documents. Given the interest in watermark generation using chaotic functions a detailed study of one chaotic function for this purpose is performed. In this paper, we present an approach for the generation of watermarks using the logistic map. Using this function, in conjunction with seed management, it is possible to generate chaotic sequences that may be used to create highpass or lowpass digital watermarks. In this paper we provide a detailed study on the generation of optically detectable watermarks and we provide some guidelines on successful chaotic watermark generation using the logistic map, and show using a recently published scheme, how care must be taken in the selection of the function seed.     

The many proofs of an identity on the norm of oblique projections

Given an oblique projector P on a Hilbert space, i.e., an operator satisfying P ²=P, which is neither null nor the identity, it holds that ||P|| = ||I –P||. This useful equality, while not widely-known, has been proven repeatedly in the literature. Many published proofs are reviewed, and simpler ones are presented.     

Extended Rees algebras and mixed multiplicities

Partially supported by the general research fund at the University of Kansas     

Initial-boundary value problems for incomplete singular perturbations of hyperbolic systems

The general problem studied has as a prototype the full non-linear Navier-Stokes equations for a slightly viscous compressible fluid including the heat transfer. The boundaries are of inflow-outflow type, i.e. non-characteristic, and the boundary conditions are the most general ones with any order of derivatives. It is assumed that the uniform Lopatinsky condition is satisfied. The goal is to prove uniform existence and boundedness of solution as the viscosity tends to zero and to justify the boundary layer asymptotics. The paper consists of two parts. In Part I the linear problem is studied. Here, uniform lower and higher order tangential estimates are derived and the existence of a solution is proved. The higher order estimates depend on the smoothness of coefficients; however this smoothness does not exceed the smoothness of the solution. In Part II the quasilinear problem is studied. It is assumed that for zero viscosity the overall initial-boundary value problem has a smooth solutionu ₀ in a time interval 0≦t≦T ₀. As a result the boundary laye, is weak and is uniformlyC ¹ bounded. This makes the linear theory applicable. an iteration scheme is set and proved to converge to the viscous solution. The convergence takes place for small viscosity and over the original time interval 0≦t≦T ₀.     

Calibrating software reliability models when the test environment does not match the user environment

Software failures have become the major factor that brings the system down or causes a degradation in the quality of service. For many applications, estimating the software failure rate from a user's perspective helps the development team evaluate the reliability of the software and determine the release time properly. Traditionally, software reliability growth models are applied to system test data with the hope of estimating the software failure rate in the field. Given the aggressive nature by which the software is exercised during system test, as well as unavoidable differences between the test environment and the field environment, the resulting estimate of the failure rate will not typically reflect the user‐perceived failure rate in the field. The goal of this work is to quantify the mismatch between the system test environment and the field environment. A calibration factor is proposed to map the failure rate estimated from the system test data to the failure rate that will be observed in the field. Non‐homogeneous Poisson process models are utilized to estimate the software failure rate in both the system test phase and the field. For projects that have only system test data, use of the calibration factor provides an estimate of the field failure rate that would otherwise be unavailable. For projects that have both system test data and previous field data, the calibration factor can be explicitly evaluated and used to estimate the field failure rate of future releases as their system test data becomes available. Copyright © 2002 John Wiley & Sons, Ltd.     

Segregation in the Falicov--Kimball Model

The Falicov–Kimball model is a simple quantum lattice model that describes light and heavy electrons interacting with an on-site repulsion; alternatively, it is a model of itinerant electrons and fixed nuclei. It can be seen as a simplification of the Hubbard model; by neglecting the kinetic (hopping) energy of the spin up particles, one gets the Falicov–Kimball model. We show that away from half-filling, i.e. if the sum of the densities of both kinds of particles differs from 1, the particles segregate at zero temperature and for large enough repulsion. In the language of the Hubbard model, this means creating two regions with a positive and a negative magnetization. Our key mathematical results are lower and upper bounds for the sum of the lowest eigenvalues of the discrete Laplace operator in an arbitrary domain, with Dirichlet boundary conditions. The lower bound consists of a bulk term, independent of the shape of the domain, and of a term proportional to the boundary. Therefore, one lowers the kinetic energy of the itinerant particles by choosing a domain with a small boundary. For the Falicov- Kimball model, this corresponds to having a single “compact” domain that has no heavy particles. Received: 21 June 2001 / Accepted: 4 January 2002